Relatively recursive reals and real functions
نویسندگان
چکیده
منابع مشابه
Relatively recursively enumerable reals
We say that a real X is relatively r.e. if there exists a real Y such that X is r.e. (Y ) and X 6≤T Y . We say X is relatively REA if there exists such a Y ≤T X. We define A ≤e1 B if there exists a Σ1 set C such that n ∈ A if and only if there is a finite E ⊆ B with (n, E) ∈ C. In this paper we show that a real X is relatively r.e. if and only if X 6≤e1 X. We prove that every nonempty Π01 class...
متن کاملReal Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to...
متن کاملAnalog computers and recursive functions over the reals
In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative continuous-time model of computation that solve...
متن کاملBeyond Recursive Real Functions
All the recursive real functions are continuous; in fact all the B-recursive real functions are continuous for any oracle B, simply because Turing Machines computing them are nite objects. But simple functions like step functions have to be in some sense be \easy" if they have recursive values and break points, although by our usual deeni-tion, they are not computable at all. So it seems unfair...
متن کاملReal recursive functions and their hierarchy
In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been 9 considered, first as a model of analog computation, and second to obtain analog characterizations of classical computational complexity classes (Unconventional Models of Computation, UMC 2002, 11 Lecture Notes in Computer Science, Vol. 2509, Springer, Berlin, pp. 1–14). However, one of the op...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00098-x